Decomposition of the min-max multi-model problem via integral sliding mode

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposition of Multi-Valued Functions into Min- and Max-Gates

This paper presents algorithms that allow the realization of multi-valued functions as a multi-level network consisting of minand max-gates. The algorithms are based on bi-decomposition of function intervals, a generalization of incompletely specified functions. Multi-valued derivation operators are applied to compute decomposition structures. For validation the algorithms have been implemented...

متن کامل

Min-Max-Boundary Domain Decomposition

Domain decomposition is one of the most eeective and popular parallel computing techniques for solving large scale numerical systems. In the special case when the amount of computation in a subdomain is proportional to the volume of the subdomain, domain decomposition amounts to minimizing the surface area of each subdomain while dividing the volume evenly. Motivated by this fact, we study the ...

متن کامل

A mathematical model for the multi-mode resource investment problem

This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...

متن کامل

Multi-input Voltage and Current-mode Min/max Circuits

-This paper presents briefly a review of the different algorithms and hardware implementations for multi-input min/max operators. This allow us to show how a clever utilization of MOS devices leads to very simple current and voltage-mode min/max circuits.

متن کامل

Solving Min-Max Multi-Depot Vehicle Routing Problem∗

The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Robust and Nonlinear Control

سال: 2005

ISSN: 1049-8923,1099-1239

DOI: 10.1002/rnc.1009